Set-monotonicity implies Kelly-strategyproofness
نویسندگان
چکیده
منابع مشابه
Set-monotonicity implies Kelly-strategyproofness
This paper studies the strategic manipulation of set-valued social choice functions according to Kelly’s preference extension, which prescribes that one set of alternatives is preferred to another if and only if all elements of the former are preferred to all elements of the latter. It is shown that set-monotonicity—a new variant of Maskin-monotonicity—implies Kellystrategyproofness in comprehe...
متن کاملMonotonicity Implies Strategy-Proofness for Correspondences
We show that Maskin monotone social choice correspondences on sufficiently rich domains satisfy a generalized strategy-proofness property, thus generalizing Muller and Satterthwaite's (1977) theorem to correspondences. From the point of view of Nash implementation theory, the result yields a partial characterization of the restrictions entailed by Nash implementability. Alternatively, the resul...
متن کاملApproximate Strategyproofness
The standard approach of mechanism design theory insists on equilibrium behavior by participants. This assumption is captured by imposing incentive constraints on the design space. But in bridging from theory to practice, it often becomes necessary to relax incentive constraints in order to allow tradeo↵s with other desirable properties. This paper surveys a number of different options that can...
متن کاملThe Thin Set Theorem for Pairs Implies DNR
Answering a question in the reverse mathematics of combinatorial principles, we prove that the Thin Set Theorem for Pairs (TS(2)) implies the Diagonally NonComputable Set Principle (DNR) over the base axiom system RCA0. 1. BACKGROUND AND DEFINITIONS The reverse mathematics of combinatorial principles has generated a good amount of interest in recent years. In particular, a lot of principles hav...
متن کاملRewriting recursive aggregates in answer set programming: back to monotonicity
Aggregation functions are widely used in answer set programming for representing and reasoning on knowledge involving sets of objects collectively. Current implementations simplify the structure of programs in order to optimize the overall performance. In particular, aggregates are rewritten into simpler forms known as monotone aggregates. Since the evaluation of normal programs with monotone a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Social Choice and Welfare
سال: 2015
ISSN: 0176-1714,1432-217X
DOI: 10.1007/s00355-015-0881-8